A Transformation System for Deductive Database Modules with Perfect Model Semantics
نویسنده
چکیده
WC present a transformation system for deductive database (DDB) modules. We show that it preserves several data-dependency properties of a DDB and is correct for the “perfect model” semantlcb of DDBs. Perfect models are not directly amenable to logical reasoning since logically equivalent DDBs may have different perfect models. We develop an approach which involves using a condltlon on data dependencies in DDBs (stratilication compatibility) to pass from a logical equivalence to equivalence under perfect model semantics. This is readily applicable to the transformation system.
منابع مشابه
Using ACTs in Disjunctive Deductive Databases
This paper describes research eeorts to develop eecient implementation techniques for disjunctive deductive databases. The aim is to build a database engine that produces perfect model semantics as introduced by Przymusinski. When used with positive dis-junctive databases the results would be equivalent to that of minimal model semantics. Our strategy is to build Access Clause Trees (ACTs) base...
متن کاملPartial Evidential Stable Models for Disjunctive Deductive Databases
In this paper we consider the basic semantics of stable and partial stable models for disjunctive deductive databases (with default negation), cf. [9,16]. It is well–known that there are disjunctive deductive databases where no stable or partial stable models exist, and these databases are called inconsistent w.r.t. the basic semantics. We define a consistent variant of each class of models, wh...
متن کاملHandling Negation in General Deductive Databases: A Program Transformation Method
In this paper, we present a program transformation approach to compute the stable models of general deductive databases. Stable models have important applications in knowledge representation, database integration and repairs as well as in efficiently solving NP-complete problems. The method introduced in the paper first transforms the given deductive database with arbitrary negation into a “sem...
متن کاملOn Computing Minimal and Perfect Model Membership
The computational complexity of a number of problems relating to minimal models of non-Horn deductive databases is considered. In particular, the problem of determining minimal model membership is shown to be NP complete for non-recursive propositional databases. The structure of minimal models is also examined using the notion of a cyclic tree, and methods of determining minimal model membersh...
متن کاملA Characterization of the Partial Stable Models for Disjunctive Deductive Databases
We give a characterization of the partial stable models of a disjunctive deductive database P in terms of the total stable models of a suitably transformed database P tu. The transformation is based on annotating the atoms in the given database by the truth values true (\t") and undeened (\u"). Currently many fast algorithms are being developed for computing the total stable models of disjuncti...
متن کامل